Bounds on Real Eigenvalues and Singular Values of Interval Matrices
نویسندگان
چکیده
We study bounds on real eigenvalues of interval matrices, and our aim is to develop fast computable formulae that produce as-sharp-as-possible bounds. We consider two cases: general and symmetric interval matrices. We focus on the latter case, since on one hand such interval matrices have many applications in mechanics and engineering, and on the other many results from classical matrix analysis could be applied to them. We also provide bounds for the singular values of (generally non-square) interval matrices. Finally, we illustrate and compare the various approaches by a series of examples.
منابع مشابه
A note on positive deniteness and stability of interval matrices
It is proved that by using bounds of eigenvalues of an interval matrix, someconditions for checking positive deniteness and stability of interval matricescan be presented. These conditions have been proved previously with variousmethods and now we provide some new proofs for them with a unity method.Furthermore we introduce a new necessary and sucient condition for checkingstability of interval...
متن کاملA note on positive deniteness and stability of interval matrices
It is proved that by using bounds of eigenvalues of an interval matrix, someconditions for checking positive deniteness and stability of interval matricescan be presented. These conditions have been proved previously with variousmethods and now we provide some new proofs for them with a unity method.Furthermore we introduce a new necessary and sucient condition for checkingstability of interval...
متن کاملOn the eigenvalues of some matrices based on vertex degree
The aim of this paper is to compute some bounds of forgotten index and then we present spectral properties of this index. In continuing, we define a new version of energy namely ISI energy corresponded to the ISI index and then we determine some bounds for it.
متن کاملCut-norms and spectra of matrices
One of the aims of this paper is to solve an open problem of Lovász about relations between graph spectra and cut-distance. The paper starts with several inequalities between two versions of the cut-norm and the two largest singular values of arbitrary complex matrices, extending, in particular, the well-known graph-theoretical Expander Mixing Lemma and giving a hitherto unknown converse of it....
متن کاملConstruction of matrices with prescribed singular values and eigenvalues
Two issues concerning the construction of square matrices with prescribed singular values and eigenvalues are addressed. First, a necessary and sufficient condition for the existence of an n × n complex matrix with n given nonnegative numbers as singular values and m(≤ n) given complex numbers to be m of the eigenvalues is determined. This extends the classical result of Weyl and Horn treating ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 31 شماره
صفحات -
تاریخ انتشار 2010